- semi-decidability
- 半可判定性
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
semi-decidability
Look at other dictionaries:
Decidability (logic) — In logic, the term decidable refers to the decision problem, the question of the existence of an effective method for determining membership in a set of formulas. Logical systems such as propositional logic are decidable if membership in their… … Wikipedia
Petri net — A Petri net (also known as a place/transition net or P/T net) is one of several mathematical modeling languages for the description of distributed systems. A Petri net is a directed bipartite graph, in which the nodes represent transitions (i.e.… … Wikipedia
Aristotle — For other uses, see Aristotle (disambiguation). Ἀριστοτέλης, Aristotélēs Marble bust of Aristotle. Roman copy after a Gree … Wikipedia
Automated theorem proving — (ATP) or automated deduction, currently the most well developed subfield of automated reasoning (AR), is the proving of mathematical theorems by a computer program. Decidability of the problem Depending on the underlying logic, the problem of… … Wikipedia
Euclidean geometry — A Greek mathematician performing a geometric construction with a compass, from The School of Athens by Raphael. Euclidean geometry is a mathematical system attributed to the Alexandrian Greek mathematician Euclid, which he described in his… … Wikipedia
Empiricism — John Locke, a leading philosopher of British empiricism This article is about the field of philosophy. For the album by Borknagar, see Empiricism (album). Empiricism is a theory of knowledge that asserts that knowledge comes only or primarily via … Wikipedia
Formal proof — See also: mathematical proof, proof theory, and axiomatic system A formal proof or derivation is a finite sequence of sentences (called well formed formulas in the case of a formal language) each of which is an axiom or follows from the… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Inquiry — For other uses, see Public inquiry and Enquiry character. An inquiry is any process that has the aim of augmenting knowledge, resolving doubt, or solving a problem. A theory of inquiry is an account of the various types of inquiry and a treatment … Wikipedia
